A Short Excursion into Semi-Algebraic Hierarchies
نویسنده
چکیده
This brief survey gives a (roughly) self-contained overview of some complexity theoretic results about semi-algebraic proof systems and related hierarchies and the strong connections between them. The article is not intended to be a detailed survey on “Lift and Project” type optimization hierarchies (cf. Chlamtac and Tulsiani [12]) or related proof systems (cf. Grigoriev et al. [16]).
منابع مشابه
On $alpha $-semi-Short Modules
We introduce and study the concept of $alpha $-semi short modules.Using this concept we extend some of the basic results of $alpha $-short modules to $alpha $-semi short modules.We observe that if $M$ is an $alpha $-semi short module then the dual perfect dimension of $M$ is $alpha $ or $alpha +1$.%In particular, if a semiprime ring $R$ is $alpha $-semi short as an $R$-module, then its Noetheri...
متن کاملSemidefinite Programming vs. LP Relaxations for Polynomial Programming
We consider the global minimization of a multivariate polynomial on a semi-algebraic set defined with polynomial inequalities. We then compare two hierarchies of relaxations, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and recent semidefinite programming (SDP) relaxations introduced by the author. The comp...
متن کاملOrder Norms on Bounded Partially Ordered Sets
In this paper, we extend the domains of affirmation and negation operators, and more important, of triangular (semi)norms and (semi)conorms from the unit interval to bounded partially ordered sets. The fundamental properties of the original operators are proven to be conserved under this extension. This clearly shows that they are essentially based upon order-theoretic notions. Consequently, a ...
متن کاملNonabelian KP hierarchy with Moyal algebraic coefficients
A higher dimensional analogue of the KP hierarchy is presented. Fundamental constituents of the theory are pseudo-differential operators with Moyal algebraic coefficients. The new hierarchy can be interpreted as large-N limit of multi-component (gl(N) symmetric) KP hierarchies. Actually, two different hierarchies are constructed. The first hierarchy consists of commuting flows and may be though...
متن کاملModeling and manipulating the structure of hierarchical schemas for the web
The Semantic Web is the next step of the current Web where information will become more machine-understandable to support effective data discovery and integration. Hierarchical schemas, either in the form of tree-like structures (e.g., DTDs, XML schemas), or in the form of hierarchies on a category/subcategory basis (e.g., thematic hierarchies of portal catalogs), play an important role in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 20 شماره
صفحات -
تاریخ انتشار 2013